Online Scheduling of Bounded Length Jobs to Maximize Throughput

نویسندگان

  • Christoph Dürr
  • Lukasz Jez
  • Nguyen Kim Thang
چکیده

We consider an online scheduling problem, motivated by the following online auction setting. A non-storable perishable good is produced at a regular rate. It has to be sold immediately to customers whose offers arrive on-line. More formally, we consider the online scheduling problem with preemptions, where each job j is revealed at release time rj , has processing time pj , deadline dj and weight wj . The goal is to maximize the total weight of all jobs completed on time. Our main result is that if all jobs have processing time not more than k, then the deterministic competitive ratio of this problem is Θ(k/ log k).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online Deadline Scheduling with Bounded Energy Efficiency

Existing work on scheduling with energy concern has focused on minimizing the energy for completing all jobs or achieving maximum throughput [19, 2, 7, 13, 14]. That is, energy usage is a secondary concern when compared to throughput and the schedules targeted may be very poor in energy efficiency. In this paper, we attempt to put energy efficiency as the primary concern and study how to maximi...

متن کامل

Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs

We study an online buffer management problem for networks supporting Quality-of-Service (QoS) applications. Packets with different QoS values arrive at a network switch and are to be sent along an outgoing link. Due to overloading conditions, some packets have to be dropped. The objective is to maximize the total value of packets that are sent. We formulate this as an online scheduling problem ...

متن کامل

Online Algorithms for Scheduling Unit Jobs

In this abstract we give a short survey of results from [5, 3] on the following unit-job scheduling problem. We are given a set of unit-length jobs, with each job specified by a triple ( ) where and are integral release times and deadlines, and is a non-negative real weight. We have a single machine, i.e., one job can be processed at each integer time. We use the term weighted throughput or gai...

متن کامل

Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput

We study the online problem of scheduling unit-time parallel jobs on hypercubes. A parallel job has to be scheduled between its release time and deadline on a subcube of processors. The objective is to maximize the number of early jobs. We provide a 1.6-competitive algorithm for the problem and prove that no deterministic algorithm is better than 1.4-competitive.

متن کامل

Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput

We consider online, nonpreemptive scheduling of equal-length jobs on parallel machines. Jobs have arbitrary release times and deadlines and a scheduler’s goal is to maximize the number of completed jobs (Pm | rj , pj = p | P 1− Uj). This problem has been previously studied under two distinct models. In the first, a scheduler must provide immediate notification to a released job as to whether it...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009